Slow relaxation in weakly open vertex-splitting rational polygons
نویسندگان
چکیده
The problem of splitting effects by vertex angles is discussed for nonintegrable rational polygonal billiards. A statistical analysis of the decay dynamics in weakly open polygons is given through the orbit survival probability. Two distinct channels for the late-time relaxation of type tδ are established. The primary channel, associated with the universal relaxation of ”regular” orbits, with δ = 1, is common for both the closed and open, chaotic and nonchaotic billiards. The secondary relaxation channel, with δ > 1, is originated from ”irregular” orbits and is due to the rationality of vertices.
منابع مشابه
On Chaotic Dynamics in Rational Polygonal Billiards
We discuss the interplay between the piece-line regular and vertex-angle singular boundary effects, related to integrability and chaotic features in rational polygonal billiards. The approach to controversial issue of regular and irregular motion in polygons is taken within the alternative deterministic and stochastic frameworks. The analysis is developed in terms of the billiard-wall collision...
متن کاملRational Design of Single-Molecule Magnets
Single-molecule magnets (SMMs) are molecules that exhibit a magnetic bistability of pure molecular origin due to a slow relaxation of the magnetization. Thus, information can be stored in a single molecule with dimensions below 5 nm. The necessary prerequisites are a high spin ground state St along with a strong magnetic anisotropy of the easy-axes type which is described by a negative zero-fie...
متن کاملA PTAS for vertex guarding weakly-visible polygons - An extended abstract
In this extended abstract, we first present a PTAS for guarding the vertices of a weakly-visible polygon P from a subset of its vertices, or in other words, a PTAS for computing a minimum dominating set of the visibility graph of the vertices of P . We then show how to obtain a PTAS for vertex guarding the entire polygon. Digital Object Identifier 10.4230/LIPIcs...
متن کامل5. Open Problems 6. References 4. Case 2: P and Q Are Arbitrary Crossing Polygons
Finding the minimum vertex distance between two dis-joint convex polygons in linear time. [6] Supowit, K. J.: The relative neighborhood graph, with an application to minimum spanning trees. A note on the all-nearest-neighbor problem for convex polygons. [10] O'Rourke, J., et al.: A new linear algorithm for intersecting convex polygons.Since P nw and Q R are two linearly separable convex polygon...
متن کاملDetecting Weakly Simple Polygons
5 A closed curve in the plane is weakly simple if it is the limit (in the Fréchet metric) 6 of a sequence of simple closed curves. We describe an algorithm to determine whether 7 a closed walk of length n in a simple plane graph is weakly simple in O(n log n) time, 8 improving an earlier O(n3)-time algorithm of Cortese et al. [Discrete Math. 2009]. As 9 an immediate corollary, we obtain the fir...
متن کامل